External Profile of Symmetric Digital Search Trees
نویسندگان
چکیده
The external profile is among the first examined shape parameters of digital search trees in connection with the performance of unsuccessful search of a random query in the early 1970s. However, finer and important properties beyond the mean such as the variance and the limit law have remained unknown. In this extended abstract, we describe the first results for the asymptotic variance and the limit law of the external profile. In particular, the analysis of the variance turns out to be highly demanding and nontrivial, and we need diverse techniques from analytic combinatorics to unveil its asymptotic behaviors.
منابع مشابه
Probabilistic analysis of the asymmetric digital search trees
In this paper, by applying three functional operators the previous results on the (Poisson) variance of the external profile in digital search trees will be improved. We study the profile built over $n$ binary strings generated by a memoryless source with unequal probabilities of symbols and use a combinatorial approach for studying the Poissonized variance, since the probability distribution o...
متن کاملOn the Average Profile of Symmetric Digital
Digital Search Trees (DST) are one of the most popular data structures storing keys, usually represented by strings. The profile of a digital search tree is a parameter that counts the number of nodes at the same distance from the root. It is a function of the number of nodes and the distance from the root. Several, if not all, tree parameters such as height, size, depth, shortest path, and fil...
متن کاملProfile and Height of Random Binary Search Trees
The purpose of this article is to survey recent results on distributional properties of random binary search trees. In particular we consider the profile and the height.
متن کاملOn the Average Profile of Symmetric Digital Search Trees∗
A digital search tree (DST) – one of the most fundamental data structures on words – is a digital tree in which keys (strings, words) are stored directly in (internal) nodes. The profile of a digital search tree is a parameter that counts the number of nodes at the same distance from the root. It is a function of the number of nodes and the distance from the root. Several tree parameters, such ...
متن کاملThe Variance of The Profile in Digital Search Trees
Author(s): R. Kazemi and M. Q. Vahidi-Asl Abstract: What today we call digital search tree (DST) is Coffman and Eve’s sequence tree introduced in 1970. A digital search tree is a binary tree whose ordering of nodes is based on the values of bits in the binary representation of a node’s key. In fact, a digital search tree is a digital tree in which strings (keys, words) are stored directly in in...
متن کامل